On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
نویسنده
چکیده
It is shown in this work that all n-dimensional hypercube networks for n P 4 are maximally 3-restricted edge connected. Employing this observation, we analyze the reliability of hypercube networks and determine the first 3n 5 coefficients of the reliability polynomial of n-cube networks. 2010 Published by Elsevier Inc.
منابع مشابه
Sufficient conditions for a graph to be super restricted edge-connected
Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut F of a connected graph G is an edge cut such that G−F has no isolated vertex. The restricted edge connectivity λ′ is theminimumcardinality over all restricted edge cuts.WecallG λ′-optimal if λ′ = ξ , where ξ is theminimum edgedegree inG. Moreover, a λ′-optimal graphG is called ...
متن کاملk-Restricted edge connectivity for some interconnection networks
k-Restricted edge connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks. In this paper we present two families of graphs similar with the networks proposed by Chen et al. [Y.C. Chen, J.J.M. Tan, L.H. Hsu, S.S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computat...
متن کاملA Survey On the Vulnerability Parameters of Networks
The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. In terms of a graph, the concept of connectedness is used in dierent forms to study many of the measures of vulnerability. When certain vert...
متن کاملColouring graphs with constraints on connectivity
A graph G has maximal local edge-connectivity k if the maximum number of edge-disjoint paths between every pair of distinct vertices x and y is at most k. We prove Brooks-type theorems for k-connected graphs with maximal local edge-connectivity k, and for any graph with maximal local edge-connectivity 3. We also consider several related graph classes defined by constraints on connectivity. In p...
متن کاملOn reliability of the folded hypercubes q
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n 2 for n P 8; and k2(FQn) = 3n 1 for n P 5. That is, for n P 8 (resp. n P 5), at least 3n 2 vertices (resp. 3n 1 edges) of FQn are removed to get a disconnected graph that contains no isolated vertices (resp. edges). When the folded hypercube is used to model th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 217 شماره
صفحات -
تاریخ انتشار 2010